Docs: Added Solutions to Leetcode 621 #1422
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
![github-actions[bot]](https://avatars.githubusercontent.com/in/15368?s=60&v=4){kind=small}
There was a problem hiding this comment.
Great job, @shreyash3087! 🎉 Thank you for submitting your pull request to CodeHarborHub. We appreciate your contribution and enthusiasm! Our team will review it soon. If you have any questions or need further assistance, feel free to reach out. Thanks for contributing!
|
Here's the code health analysis summary for commits Analysis Summary
|
ajay-dhangar
added
documentation
ajay-dhangar
requested changes
Jun 16, 2024
|
|
||
| ### Constraints | ||
|
|
||
| - $1 <= tasks.length <= 10^4$ |
There was a problem hiding this comment.
replace $1 <= tasks.length <= 10^4$ to $1 \leq \text{tasks.length} \leq 10^4$
|
|
||
| - $1 <= tasks.length <= 10^4$ | ||
| - `tasks[i]` is an uppercase English letter. | ||
| - $0 <= n <= 100$ |
There was a problem hiding this comment.
replace $0 <= n <= 100$ to $0 \leq n \leq 100$
|
|
||
| ### Space Complexity: $O(1)$ | ||
|
|
||
| > **Reason**: The space complexity is mainly determined by the frequency array and the priority queue. The frequency array has a constant size of 26, and the priority queue can have a maximum size of 26 when all distinct tasks are present. Therefore, the overall space complexity is O(1) or O(26), which is considered constant. |
There was a problem hiding this comment.
replace O(1) to $O(1)$, O(26) to $O(26)$
|
|
||
| > **Reason**: The space complexity is mainly determined by the frequency array and the priority queue. The frequency array has a constant size of 26, and the priority queue can have a maximum size of 26 when all distinct tasks are present. Therefore, the overall space complexity is O(1) or O(26), which is considered constant. | ||
|
|
||
| ### Approach #2 Filling the Slots and Sorting |
| > | ||
| > - In Python, the sort method sorts a list using the Timsort algorithm which is a combination of Merge Sort and Insertion Sort and has O(N) additional space. | ||
| > - In Java, Arrays.sort() is implemented using a variant of the Quick Sort algorithm which has a space complexity of O(logN) for sorting two arrays. | ||
| > - In C++, the sort() function is implemented as a hybrid of Quick Sort, Heap Sort, and Insertion Sort, with a worse-case space complexity of O(logN). |
| > | ||
| > Note that some extra space is used when we sort arrays in place. The space complexity of the sorting algorithm depends on the programming language. | ||
| > | ||
| > - In Python, the sort method sorts a list using the Timsort algorithm which is a combination of Merge Sort and Insertion Sort and has O(N) additional space. |
|
|
||
| > **Reason**: The frequency array has a size of 26. | ||
| > | ||
| > Note that some extra space is used when we sort arrays in place. The space complexity of the sorting algorithm depends on the programming language. |
There was a problem hiding this comment.
If you want to use note then try
:::note
// YOUR NOTES HERE
:::Try this for best practice
There was a problem hiding this comment.
|
@ajay-dhangar Done |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Related Issue
Closes #1379
Description
This PR adds the solution to leetcode problem 6621 - (Task Scheduler)
Type of PR
Screenshots / Videos (if applicable)
Checklist
Additional Context
N/A